$k$ Out of $n$ Region Incrementing Scheme in Visual Cryptography

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New Region Incrementing Visual Cryptography Scheme

Recently, Wang introduced a novel (2, n) region incrementing visual cryptography scheme (RIVCS), which can gradually reconstruct visual secrets with multiple secrecy levels in a single image. A secret image is divided into multiple regions, where each region has a certain level of secrecy. Any t shadow images, where 2tn, can be used to reveal (t1) levels of secrets. However, in Wang’s scheme...

متن کامل

Construction of General (k, n) Probabilistic Visual Cryptography Scheme

⎯Visual cryptography scheme (VCS) is a secure method that encrypts a secret image by subdividing it into shadow images. Due to the nature of encryption VCS is categorized into two types: the deterministic VCS (DVCS) and the probabilistic VCS (PVCS). For the DVCS, we use m (known as the pixel expansion) subpixels to represent a secret pixel. The PVCS uses only one subpixel to represent a secret ...

متن کامل

k out of n NonBinary Audio Cryptography Using Polynomial Interpolation

Audio cryptography is same like a visual cryptography. A plain data (audio file) is split into two or more shares. Each single share does not convey any meaning but when shares are combined together they will reveal the original data. In Audio cryptography the "plaintext" is an audio File. k out of n Nonbinary Audio Cryptography scheme is a special type of secret sharing scheme which is more se...

متن کامل

k-n Secret Sharing Visual Cryptography Scheme on Color Image using Random Sequence

Visual cryptography is a special type of encryption technique where visual information (Image, Text etc) gets encrypted in such a way that decryption can be performed by Human Visual System with a computation free decryption process. The beauty of the visual secret sharing scheme is in its decryption process where without any complex cryptographic computation encrypted data is decrypted using H...

متن کامل

Number theory based { k , n } Visual Cryptography Scheme For Color Images

An efficient and secure visual secret sharing scheme suitable for transmission of color images is introduced and discussed in this paper. The scheme employs number theory concepts and the pixel level representation of the color image to derive reciprocal encryption and decryption procedures. Using the input color image, the scheme generates n shares which are then distributed to participants. A...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Circuits and Systems for Video Technology

سال: 2012

ISSN: 1051-8215,1558-2205

DOI: 10.1109/tcsvt.2011.2180952